Introduction to Secure PRNGs

Introduction to Secure PRNGs

Pseudo-Random Number Generators (PRNGs) are required for generating secret keys in cryptographic algorithms, generating sequences of packet in Network simulations (workload generators) and other applications in various fields. In this paper we will discuss a list of some requirements for generating a reliable random sequence and then will present some PRNG methods which are based on combination...

Secure PRNGs from Specialized Polynomial Maps over Any

We prove that a random map drawn from any class C of polynomial maps from (Fq) to (Fq) that is (i) totally random in the a ne terms, and (ii) has a negligible chance of being not strongly one-way, provides a secure PRNG (hence a secure stream cipher) for any q. Plausible choices for C are semi-sparse (i.e., the a ne terms are truly random) systems and other systems that are easy to evaluate fro...

Secure PRNGs from Specialized Polynomial Maps over Any Fq

Berbain, Gilbert, and Patarin presented QUAD, a pseudo random number generator (PRNG) at Eurocrypt 2006. QUAD (as PRNG and stream cipher) may be proved secure based on an interesting hardness assumption about the one-wayness of multivariate quadratic polynomial systems over F2. The original BGP proof only worked for F2 and left a gap to general Fq. We show that the result can be generalized to ...

An Introduction to Secure Remote Access

INTRODUCTION In the last decade, the problem of establishing and controlling remote access to corporate networks has become one of the most difficult issues facing network administrators and information security professionals. As information-based businesses become a larger and larger fraction of the global economy, the nature of “business” itself changes. “Work” used to take place in a well-de...

An Introduction to Sociolinguistics